public class Something {
    /*'
      public ListNode reverseBetween(ListNode head, int left, int right) {
        ListNode newHead = new ListNode(-1);
        newHead.next = head;
        ListNode prev = newHead;
        for (int i = 0; i < left - 1; i++) {
            prev = prev.next;
        }
        ListNode cur = prev.next, next = null;
        for (int i = 0; i < right - left; i++) {
            next = cur.next;
            cur.next = next.next;
            next.next = prev.next;
            prev.next = next;
        }
        return newHead.next;
    }
     */

    /*
     public ListNode rotateRight(ListNode head, int k) {
        if (head == null || head.next == null || k == 0) {
            return head;
        }
        int length = 0;
        ListNode cur = head;
        while (cur != null) {
            ++length;
            cur = cur.next;
        }
        k %= length;
        if (k == 0) {
            return head;
        }
        ListNode newHead = new ListNode(-1);
        ListNode slow = head, fast = head, prev = null;
        for (int i = 0; i < k; i++) {
            fast = fast.next;
        }
        while (fast.next != null) {
            prev = slow;
            slow = slow.next;
            fast = fast.next;
        }
        prev = slow;
        slow = slow.next;
        prev.next = null;
        fast.next = head;
        newHead.next = slow;
        return newHead.next;
    }
     */

    /*
     public boolean hasAlternatingBits(int n) {
        int prev = 2;
        while (n != 0) {
            int cur = n % 2;
            if (cur == prev) {
                return false;
            }
            prev = cur;
            n /= 2;
        }
        return true;
    }
     */

    /*
    public int[] sortArrayByParityII(int[] nums) {
        int odd = 1, even = 0, last = nums.length - 1;
        while (odd < nums.length && even < nums.length) {
            if ((nums[last] & 1) == 0) {
                swap(nums, last, even);
                even += 2;
            } else {
                swap(nums, last, odd);
                odd += 2;
            }
        }
        return nums;
    }

    public void swap(int[] arr, int  o1, int o2) {
        int t = arr[o1];
        arr[o1] = arr[o2];
        arr[o2] = t;
    }
     */

    /*
    public int[] sortArrayByParity(int[] nums) {
        int odd = -1, cur = 0;
        while (cur < nums.length) {
            if ((nums[cur] & 1) == 0) {
                swap(nums, ++odd, cur++);
            } else {
                cur++;
            }
        }
        return nums;
    }

    public void swap(int[] arr, int o1, int o2) {
        int t = arr[o1];
        arr[o1] = arr[o2];
        arr[o2] = t;
    }
     */

    public static void main(String[] args) {
        System.out.println("Long lost, forever found");
    }
}
